HISTORY MATCHING WITH SUBSET SIMULATION
نویسندگان
چکیده
Computational cost often hinders the calibration of complex computer models. In this context, history matching (HM) is becoming a widespread strategy, with applications in many disciplines. HM uses statistical approximation, also known as an emulator, to model output, order mitigate computational cost. The process starts observation physical system. It then produces progressively more accurate emulators determine non-implausible domain: subset input space that provides good agreement between output and data, conditional on structure, sources uncertainty, implausibility measure. HM, it essential generate samples from nonimplausible domain, run train emulator until stopping condition met. However, sampling can be very challenging, since domain become orders magnitude smaller than original quickly. This paper proposes solution problem using simulation, rare event technique works efficiently high dimensions. proposed approach demonstrated via robust design examples field aerospace engineering.
منابع مشابه
A Novel Assisted History Matching Workflow and its Application in a Full Field Reservoir Simulation Model
The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...
متن کاملA Direct Sequential Simulation Approach to Streamline- Based History Matching
Streamlines have proven useful for visualizing and solving complex history-matching problems that enhance reservoir description. This paper presents a novel, multiple-scale streamline-based technique that perturbs the reservoir model in a manner fully consistent with prior geological data. Streamlines define dynamic drainage zones around production wells and the mismatch between historical and ...
متن کاملBranch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today’s fastest machines and simulators takes several weeks. A practical solution to the simulation problem is sampling. Sampled simulation selects a number of sampling units out of a complete program execution and only simulat...
متن کاملTree Pattern Matching to Subset Matching in Linear Time
In this paper, we show an O(n + m) time Turing reduction from the tree pattern matching problem to another problem called the subset matching problem. Subsequent works have given efficient deterministic and randomized algorithms for the subset matching problem. Together, these works yield an O ( n log m+m ) time deterministic algorithm and an O(n logn + m) time Monte Carlo algorithm for the tre...
متن کاملA New Algorithm for Subset Matching Problem
The subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet Σ. The pattern is said to occur at text position i if the set p[j] is a subset of the set t[i + j 1], for all j (1 ≤ j ≤ m). This is a generalization of the ordinary string matching and can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Uncertainty Quantification
سال: 2021
ISSN: ['2152-5080', '2152-5099']
DOI: https://doi.org/10.1615/int.j.uncertaintyquantification.2021033543